Probabilistic assessment of transport network vulnerability with equilibrium flows
نویسندگان
چکیده
منابع مشابه
assessment of the efficiency of s.p.g.c refineries using network dea
data envelopment analysis (dea) is a powerful tool for measuring relative efficiency of organizational units referred to as decision making units (dmus). in most cases dmus have network structures with internal linking activities. traditional dea models, however, consider dmus as black boxes with no regard to their linking activities and therefore do not provide decision makers with the reasons...
Network Vulnerability Assessment:
Adaptivity requires at least frequent, and ideally real-time, updates and also requires the ability to analyze, respond and reconfigure. Such network management flexibility requires several types of information and capabilities, which include response of the network to node failure, reachability of nodes, and boundary control. The first issue determines how the network will respond to a "proble...
متن کاملEffective Network Vulnerability Assessment through Model Abstraction
A significant challenge in evaluating network security stems from the scale of modern enterprise networks and the vast number of vulnerabilities regularly found in software applications. A common technique to deal with this complexity is attack graphs, where a tool automatically computes all possible ways a system can be broken into by analyzing the configuration of each host, the network, and ...
متن کاملVulnerability Measure of a Network - a Survey
In this paper we discuss about tenacity and its properties in stability calculation. We indicate relationships between tenacity and connectivity, tenacity and binding number, tenacity and toughness. We also give good lower and upper bounds for tenacity. Since we are primarily interested in the case where disruption of the graph is caused by the removal of a vertex or vertices (and the resulting...
متن کاملEquilibrium Flows and Path Dilation for a Network Forwarding Game
We consider a forwarding game on directed graphs where selfish nodes need to send certain amount of flow (packets) to specific destinations, possibly through several relay nodes. Each node has to decide whether to pay the cost of relaying flow as an intermediate node, given the fact that its neighbors can punish it for its non-cooperation. In this work we simplify the original network model, an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Sustainable Transportation
سال: 2020
ISSN: 1556-8318,1556-8334
DOI: 10.1080/15568318.2020.1770904